An analogue of Ruzsa's conjecture for polynomials over finite fields
نویسندگان
چکیده
In 1971, Ruzsa conjectured that if f : N ? Z with ( n + k ) ? mod for every , ? and = O ? < e then is a polynomial. this paper, we investigate the analogous problem ring of polynomials over finite field using Polynomial Method in combinatorics.
منابع مشابه
Irreducible Polynomials over Finite Fields
As we will see, modular arithmetic aids in testing the irreducibility of polynomials and even in completely factoring polynomials in Z[x]. If we expect a polynomial f(x) is irreducible, for example, it is not unreasonable to try to find a prime p such that f(x) is irreducible modulo p. If we can find such a prime p and p does not divide the leading coefficient of f(x), then f(x) is irreducible ...
متن کاملSettled Polynomials over Finite Fields
We study the factorization into irreducibles of iterates of a quadratic polynomial f over a finite field. We call f settled when the factorization of its nth iterate for large n is dominated by “stable” polynomials, namely those that are irreducible under post-composition by any iterate of f . We prove that stable polynomials may be detected by their action on the critical orbit of f , and that...
متن کاملProof of Tate’s conjecture over finite fields
We start by showing that (1) is injective. Take an u ∈ Hom (A,B)⊗ Zl that maps to zero in HomΓ (Tl(A), Tl(B)). Write u = ∑∞ j=0 l uj , uj ∈ Hom(A,B), and [u]n for ∑n j=0 l uj . Note that since Hom (A,B) is a Z-module [u]n is in Hom (A,B). Now (since u maps to zero) [u]n is the zero morphism A[l ] → B[l], so it kills the ltorsion. As it is well known, this implies the existence of a certain ψn ∈...
متن کاملCarlitz-Wan conjecture for permutation polynomials and Weil bound for curves over finite fields
The Carlitz-Wan conjecture, which is now a theorem, asserts that for any positive integer n, there is a constant Cn such that if q is any prime power > Cn with GCD(n, q−1) > 1, then there is no permutation polynomial of degree n over the finite field with q elements. From the work of von zur Gathen, it is known that one can take Cn = n4. On the other hand, a conjecture of Mullen, which asserts ...
متن کاملSearch of Primitive Polynomials over Finite Fields
Let us introduce some notations and definitions: if p denotes a prime integer and n a positive integer, then GF(p”) is the field containing pn elements. a primitive element of GF(p”) is a generator of the cyclic multiplicative group GVP”)*, a manic irreducible polynomial of degree n belonging to GF(p)[X] is called primitive if its roots are primitive elements of GF(p”). These polynomials are in...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Combinatorial Theory, Series A
سال: 2021
ISSN: ['0097-3165', '1096-0899']
DOI: https://doi.org/10.1016/j.jcta.2020.105337